搜索资源列表
BRANCH
- 分枝定界法，运筹学-branch-and-bound method, and operations
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
Fac6_3
- //本程序取自王晓东编著“算法分析与设计”第 198 页，例 //装载问题的分支限界解法-//This procedure Xiaodong edited from the Algorithm Analysis and Design, p. 198, for example,// load the problem branch and bound method
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
TravelingSalesmanProblem
- This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for
p2_branch
- branch and bound algorithm for solving a scheduling problem
A-branch-and-bound-algorithm-for-asymmetric-TSP.r
- A branch-and-bound algorithm for asymmetric TSP
bound
- 算法分析与设计 利用分支界限法计算载重问题-Calculate the weight using branch and bound problems
the-branch-and-bound-algorithm
- 算法：用分支定界求最短路径,北航计算机学院算法课作业-Algorithm: get the shortest path using the branch and bound algorithm
Branch-and-Bound
- 最新国际顶级杂志IJCV2011目标检测论文-Branch and Bound Hough Transform for Object Class Detection,IJCV2011
branch-and-bound-algorithm
- 分支界限算法，通过一个小实例简单的介绍了分支界限算法的思想，其中包括源码运行截图和运行的.exe文件-A brief introduction of the branch and bound algorithm
branch-and-bound
- 分支定界法求解TSp问题的分析研究以及matlab实现-Branch and bound method to solve the problem described TSp
branch-and-bound-algorithm
- 利用c++实现城市遍历问题的分枝定界算法。-Use c++ achieve urban traversal problem branch and bound algorithm.
Branch-and-bound-method
- MALAB写的，分支定界法求解纯整数或混合的整数规划问题。-Written MALAB, branch and bound method to solve pure integer or mixed integer programming problem.
Branch-and-bound
- VC6.0中控制台应用程序实现的分支限界的算法。-Branch and bound algorithm VC6.0 console application implementation.
branch-and-bound
- 离散问题的分支定界法（branch and bound）的学习资料-branch and bound
branch-and-bound-method
- 利用分支限界法找出最大全1子团和最大全-1子团，内附文档说明-Use branch and bound method to find the maximum full sub-group and the largest full 1 sub-group, enclosing documentation
Traveling-Salesman-Problem-with-Branch-and-Bound-
- branch and bound for solve travel salse man problem
分支定界法
- 分支定界法，可以求解线性规划问题，用matlab解决，感觉不错(Branch and bound method can be used to solve linear programming problems)
code_branch_s3vm
- 分支定界的半监督支持向量机，将分支定界与半监督SVM完美的结合(semi-supervised support vector machine based on branch and bound)